3-Phase Matheuristic Model in Two-Dimensional Cutting Stock Problem of Triangular Shape Items
نویسندگان
چکیده
منابع مشابه
One-dimensional Cutting Stock Problem with Divisible Items
This paper considers the one-dimensional cutting stock problem with divisible items, which is a new problem in the cutting stock literature. The problem exists in steel industries. In the new problem, each item can be divided into smaller pieces, then they can be recombined again by welding. The objective is to minimize both the trim loss and the number of the welds. We present a mathematical m...
متن کاملArc-Flow Model for the Two-Dimensional Cutting Stock Problem
We describe an exact model for the two-dimensional Cutting Stock Problem with two stages and the guillotine constraint. It is a linear programming arc-flow model, formulated as a minimum flow problem, which is an extension of a model proposed by Valério de Carvalho for the one dimensional case. In this paper, we explore how this model behaves when it is solved with a commercial software, explic...
متن کاملHeuristics for two-dimensional knapsack and cutting stock problems with items of irregular shape
In this paper, the two-dimensional cutting/packing problem with items that correspond to simple polygons that may contain holes are studied in which we propose algorithms based on No-Fit polygon computation. We present a GRASP based heuristic for the 0/1 version of the Knapsack Problem, and another heuristic for the unconstrained version of the Knapsack Problem. This last heuristic is divided i...
متن کاملAn ACO algorithm for one-dimensional cutting stock problem
The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a meta-heuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...
متن کاملA simple approach to the two-dimensional guillotine cutting stock problem
Cutting stock problems are within knapsack optimization problems and are considered as a non-deterministic polynomial-time (NP)-hard problem. In this paper, two-dimensional cutting stock problems were presented in which items and stocks were rectangular and cuttings were guillotine. First, a new, practical, rapid, and heuristic method was proposed for such problems. Then, the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science and Technology Indonesia
سال: 2020
ISSN: 2580-4391,2580-4405
DOI: 10.26554/sti.2020.5.1.23-27